Best Approximation under a Convex Paranorm

نویسنده

  • Guido Moerkotte
چکیده

We introduce the q-paranorm, investigate some of its properties. We further give an algorithm which constructs the best linear approximations under the q-paranorm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New best proximity point results in G-metric space

Best approximation results provide an approximate solution to the fixed point equation $Tx=x$, when the non-self mapping $T$ has no fixed point. In particular, a well-known best approximation theorem, due to Fan cite{5}, asserts that if $K$ is a nonempty compact convex subset of a Hausdorff locally convex topological vector space $E$ and $T:Krightarrow E$ is a continuous mapping, then there exi...

متن کامل

Coincidence Quasi-Best Proximity Points for Quasi-Cyclic-Noncyclic Mappings in Convex Metric Spaces

We introduce the notion of quasi-cyclic-noncyclic pair and its relevant new notion of coincidence quasi-best proximity points in a convex metric space. In this way we generalize the notion of coincidence-best proximity point already introduced by M. Gabeleh et al cite{Gabeleh}. It turns out that under some circumstances this new class of mappings contains the class of cyclic-noncyclic mappings ...

متن کامل

SIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD

In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...

متن کامل

Integrated Convex Optimization in Banach Space and its Application to Best Simultaneous Approximation∗

Concept of locally ε-maximal is proposed and employed to explored the optimization problem of a set of convex functions on a Banach space in this paper. Generalized saddle point (GSP) is also used to study the optimization problem , which is equivalent to the optimal solution under the condition of locally ε-maximal. An application of the optimization theory to best simultaneous approximation i...

متن کامل

Best Simultaneous Approximation to Totally Bounded Sequences in Banach Spaces

This paper is concerned with the problem of best weighted simultaneous approximations to totally bounded sequences in Banach spaces. Characterization results from convex sets in Banach spaces are established under the assumption that the Banach space is uniformly smooth.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009